const runtime.ptrBits
45 uses
runtime (current package)
arena.go#L566: for i := uintptr(0); i < nb; i += ptrBits {
arena.go#L568: if k > ptrBits {
arena.go#L569: k = ptrBits
arena.go#L617: h.low = offset / goarch.PtrSize % ptrBits
arena.go#L632: if h.valid+valid <= ptrBits {
arena.go#L642: h.mask = bits >> (ptrBits - h.valid) // leftover for next word
arena.go#L643: h.valid += valid - ptrBits // have h.valid+valid bits, writing ptrBits of them
arena.go#L646: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L656: h.offset += ptrBits * goarch.PtrSize
arena.go#L667: for words > ptrBits {
arena.go#L668: h = h.write(s, 0, ptrBits)
arena.go#L669: words -= ptrBits
arena.go#L686: z := ptrBits - h.valid
arena.go#L696: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L709: h.offset += ptrBits * goarch.PtrSize
arena.go#L718: idx := h.offset / (ptrBits * goarch.PtrSize)
arena.go#L719: if zeros < ptrBits {
arena.go#L722: } else if zeros == ptrBits {
arena.go#L727: zeros -= ptrBits
arena.go#L729: h.offset += ptrBits * goarch.PtrSize
mbitmap.go#L101: minSizeForMallocHeader = goarch.PtrSize * ptrBits
mbitmap.go#L260: tp.mask ^= uintptr(1) << (i & (ptrBits - 1))
mbitmap.go#L285: if tp.addr+goarch.PtrSize*ptrBits >= tp.elem+tp.typ.PtrBytes {
mbitmap.go#L289: tp.addr += ptrBits * goarch.PtrSize
mbitmap.go#L299: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L300: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L301: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L324: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L325: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L326: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L338: tp.addr = tp.elem + alignDown(n-(tp.elem-oldelem), ptrBits*goarch.PtrSize)
mbitmap.go#L340: tp.addr += alignDown(n, ptrBits*goarch.PtrSize)
mbitmap.go#L360: if tp.addr+goarch.PtrSize*ptrBits > limit {
mbitmap.go#L361: bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize
mbitmap.go#L362: tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits)
mbitmap.go#L614: i := (addr - span.base()) / goarch.PtrSize / ptrBits
mbitmap.go#L615: j := (addr - span.base()) / goarch.PtrSize % ptrBits
mbitmap.go#L621: if j+bits > ptrBits {
mbitmap.go#L623: bits0 := ptrBits - j
mbitmap.go#L663: i := o / ptrBits
mbitmap.go#L664: j := o % ptrBits
mbitmap.go#L665: if j+bits > ptrBits {
mbitmap.go#L667: bits0 := ptrBits - j
mbitmap.go#L965: for i := uintptr(0); i < ptrBits; i++ {
mbitmap.go#L1319: const ptrBits = 8 * goarch.PtrSize
![]() |
The pages are generated with Golds v0.7.6. (GOOS=linux GOARCH=amd64) Golds is a Go 101 project developed by Tapir Liu. PR and bug reports are welcome and can be submitted to the issue list. Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |